Low-Complexity Distributed Radio Access Network Slicing: Algorithms and Experimental Results
نویسندگان
چکیده
منابع مشابه
Low-Complexity Distributed Radio Access Network Slicing: Algorithms and Experimental Results
Radio access network (RAN) slicing is an effective methodology to dynamically allocate networking resources in 5G networks. One of the main challenges of RAN slicing is that it is provably an NP-Hard problem. For this reason, we design near-optimal low-complexity distributed RAN slicing algorithms. First, we model the slicing problem as a congestion game, and demonstrate that such game admits a...
متن کاملRadio Access Network Resource Slicing for Flexible Service Execution
Network slicing is a key enabler for the serviceoriented 5G vision, that aims to satisfy various per-service requirements. Unlike core network slicing, radio access network (RAN) slicing is still at its infancy, with several works just starting to investigate the challenges and potentials to enable a mutli-tenant, multi-service RAN. One of the major challenges in RAN slicing is to provide diffe...
متن کاملContent-oriented network slicing optimization based on cache-enabled hybrid radio access network
With the development of smart mobile devices and various mobile applications, content-oriented service has become the most popular service which occupies network resources and results in high traffic load. In order to improve quality of experience in radio access network and reduce the OpEx and CapEx of operators, wireless network virtualization and network slicing come into the vision and are ...
متن کاملHSDRAN: Hierarchical Software-Defined Radio Access Network for Distributed Optimization
The drastic growth of mobile traffic greatly challenges the capacity of mobile infrastructures. Dense deployment of low-power small cells helps alleviate the congestion in the radio access network, yet it also introduces large complexity for network management. Software-defined radio access network has been proposed to tackle the added complexity. However, existing software-defined solutions re...
متن کاملRadio Network Distributed Algorithms in the Unknown Neighborhood Model
The paper deals with radio network distributed algorithms where nodes are not aware of their one hop neighborhood. Given an n-node graph modeling a multihop network of radio devices, we give a O(log n) time distributed algorithm that computes w.h.p., a constant approximation value of the degree of each node. We also provide a O(∆ log n+ log n) time distributed algorithm that computes w.h.p., a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2018
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2018.2878965